A two obstacles coupled problem
نویسندگان
چکیده
منابع مشابه
Optimization of A Thermal Coupled Flow Problem of Semiconductor Melts
In this paper we describe the formal Lagrange-technique to optimize the production process of solid state crystals from a mixture crystal melt. After the construction of the adjoint equation system of the Boussinesq equation of the crystal melt the forward and backward problems (KKT-system) are discretized by a conservative finite volume method.
متن کاملAnalytical Solution for Two-Dimensional Coupled Thermoelastodynamics in a Cylinder
An infinitely long hollow cylinder containing isotropic linear elastic material is considered under the effect of arbitrary boundary stress and thermal condition. The two-dimensional coupled thermoelastodynamic PDEs are specified based on equations of motion and energy equation, which are uncoupled using Nowacki potential functions. The Laplace integral transform and Bessel-Fourier series are u...
متن کاملA Two-Stage Hybrid Flowshop Scheduling Problem with Serial Batching
In this paper the problem of serial batch scheduling in a two-stage hybrid flow shop environment with minimizing Makesapn is studied. In serial batching it is assumed that jobs in a batch are processed serially, and their completion time is defined to be equal to the finishing time of the last job in the batch. The analysis and implementation of the prohibited transference of jobs among the mac...
متن کاملSolving a Two-Period Cooperative Advertising Problem Using Dynamic Programming
Cooperative advertising is a cost-sharing mechanism in which a part of retailers' advertising investments are financed by the manufacturers. In recent years, investment among advertising options has become a difficult marketing issue. In this paper, the cooperative advertising problem with advertising options is investigated in a two-period horizon in which the market share in the second period...
متن کاملEuclidean TSP between two nested convex obstacles
We present a polynomial-time algorithm for a variant of the Euclidean traveling salesman tour where n vertices are on the boundary of a convex polygon P and m vertices form the boundary of a convex polygonal obstacle Q completely contained within P . In the worst case the algorithm needs O(m lg m+ mn) time and O(nm + m) space.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nonlinear Analysis: Theory, Methods & Applications
سال: 2015
ISSN: 0362-546X
DOI: 10.1016/j.na.2015.02.019